package 测试;

import java.util.Scanner;

public class 兔子藏洞 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			// String[] split = sc.nextLine().split(" ");
			// int x = Integer.parseInt(split[0]);
			// int n = Integer.parseInt(split[1]);
			int x = Integer.parseInt(sc.next());
			int n = Integer.parseInt(sc.next());
			System.out.println(fun(x, n));
		}
		sc.close();

	}

	private static String fun(int x, int n) {
		int[] a = new int[20];
		for (int i = 0; i < 20; i++) {
			a[i] = i + 1;
		}

		for (int i = 1; i <= n; i++) {
			int loc = (x + (i + 1) * i / 2 - 1);
			int findNum = loc > 20 ? loc % 20 : loc;
			if (findNum != 0 && a[findNum - 1] != -1) {
				a[findNum - 1] = -1;
			} else if (findNum == 0) {
				a[19] = -1;
			}
		}

		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < 20; i++) {
			if (a[i] != -1) {
				sb.append(a[i]).append(" ");
			}
		}
		if (sb.length() == 0)
			return "-1";
		return sb.toString();
	}

}
